Unambiguous Discrimination Between Linearly Dependent States with Multiple Copies

A set of quantum states can be unambiguously discriminated if and only if they are linearly independent. However, for a linearly dependent set, if C copies of the state are available, then the resulting C particle states may form a linearly independent set, and be amenable to unambiguous discrimination. We obtain necessary and sufficient conditions for the possibility of unambiguous discrimination between N states given that C copies are available and that the single copies span a D dimensional space. These conditions are found to be identical for qubits. We then examine in detail the linearly dependent trine ensemble. The set of C>1 copies of each state is a set of linearly independent lifted trine states. The maximum unambiguous discrimination probability is evaluated for all C>1 with equal a priori probabilities.Comment: 12 Pages RevTeX 4, 1 EPS figur

Optimal phase estimation and square root measurement

We present an optimal strategy having finite outcomes for estimating a single parameter of the displacement operator on an arbitrary finite dimensional system using a finite number of identical samples. Assuming the uniform {\it a priori} distribution for the displacement parameter, an optimal strategy can be constructed by making the {\it square root measurement} based on uniformly distributed sample points. This type of measurement automatically ensures the global maximality of the figure of merit, that is, the so called average score or fidelity. Quantum circuit implementations for the optimal strategies are provided in the case of a two dimensional system.Comment: Latex, 5 figure

Distributed implementation of standard oracle operators

The standard oracle operator corresponding to a function f is a unitary operator that computes this function coherently, i.e. it maintains superpositions. This operator acts on a bipartite system, where the subsystems are the input and output registers. In distributed quantum computation, these subsystems may be spatially separated, in which case we will be interested in its classical and entangling capacities. For an arbitrary function f, we show that the unidirectional classical and entangling capacities of this operator are log_{2}(n_{f}) bits/ebits, where n_{f} is the number of different values this function can take. An optimal procedure for bidirectional classical communication with a standard oracle operator corresponding to a permutation on Z_{M} is given. The bidirectional classical capacity of such an operator is found to be 2log_{2}(M) bits. The proofs of these capacities are facilitated by an optimal distributed protocol for the implementation of an arbitrary standard oracle operator.Comment: 4.4 pages, Revtex 4. Submitted to Physical Review Letter

Minimum-error discrimination between mixed quantum states

We derive a general lower bound on the minimum-error probability for {\it ambiguous discrimination} between arbitrary $m$ mixed quantum states with given prior probabilities. When $m=2$, this bound is precisely the well-known Helstrom limit. Also, we give a general lower bound on the minimum-error probability for discriminating quantum operations. Then we further analyze how this lower bound is attainable for ambiguous discrimination of mixed quantum states by presenting necessary and sufficient conditions related to it. Furthermore, with a restricted condition, we work out a upper bound on the minimum-error probability for ambiguous discrimination of mixed quantum states. Therefore, some sufficient conditions are obtained for the minimum-error probability attaining this bound. Finally, under the condition of the minimum-error probability attaining this bound, we compare the minimum-error probability for {\it ambiguously} discriminating arbitrary $m$ mixed quantum states with the optimal failure probability for {\it unambiguously} discriminating the same states.Comment: A further revised version, and some results have been adde

Retrodiction of Generalised Measurement Outcomes

If a generalised measurement is performed on a quantum system and we do not know the outcome, are we able to retrodict it with a second measurement? We obtain a necessary and sufficient condition for perfect retrodiction of the outcome of a known generalised measurement, given the final state, for an arbitrary initial state. From this, we deduce that, when the input and output Hilbert spaces have equal (finite) dimension, it is impossible to perfectly retrodict the outcome of any fine-grained measurement (where each POVM element corresponds to a single Kraus operator) for all initial states unless the measurement is unitarily equivalent to a projective measurement. It also enables us to show that every POVM can be realised in such a way that perfect outcome retrodiction is possible for an arbitrary initial state when the number of outcomes does not exceed the output Hilbert space dimension. We then consider the situation where the initial state is not arbitrary, though it may be entangled, and describe the conditions under which unambiguous outcome retrodiction is possible for a fine-grained generalised measurement. We find that this is possible for some state if the Kraus operators are linearly independent. This condition is also necessary when the Kraus operators are non-singular. From this, we deduce that every trace-preserving quantum operation is associated with a generalised measurement whose outcome is unambiguously retrodictable for some initial state, and also that a set of unitary operators can be unambiguously discriminated iff they are linearly independent. We then examine the issue of unambiguous outcome retrodiction without entanglement. This has important connections with the theory of locally linearly dependent and locally linearly independent operators.Comment: To appear in Physical Review

Finding optimal strategies for minimum-error quantum-state discrimination

We propose a numerical algorithm for finding optimal measurements for quantum-state discrimination. The theory of the semidefinite programming provides a simple check of the optimality of the numerically obtained results.Comment: 4 pages, 2 figure

Strategies and Networks for State-Dependent Quantum Cloning

State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the maximum global fidelity of $N$ approximate clones given $M$ initial exact copies, where $N>M$. We also consider strategies which interpolate between approximate and exact cloning. A tight inequality is obtained which expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit as $N{\to}{\infty}$, to a known inequality which expresses the trade-off between error and inconclusive result probabilities for state-discrimination measurements. Quantum-computational networks are also constructed for the kinds of cloning machine we describe. For this purpose, we introduce two gates: the distinguishability transfer and state separation gates. Their key properties are describedComment: 12 pages, 6 eps figures, submitted to Phys. Rev.

Optimal minimum-cost quantum measurements for imperfect detection

Knowledge of optimal quantum measurements is important for a wide range of situations, including quantum communication and quantum metrology. Quantum measurements are usually optimised with an ideal experimental realisation in mind. Real devices and detectors are, however, imperfect. This has to be taken into account when optimising quantum measurements. In this paper, we derive the optimal minimum-cost and minimum-error measurements for a general model of imperfect detection.Comment: 5 page

Discrimination of two mixed quantum states with maximum confidence and minimum probability of inconclusive results

We study an optimized measurement that discriminates two mixed quantum states with maximum confidence for each conclusive result, thereby keeping the overall probability of inconclusive results as small as possible. When the rank of the detection operators associated with the two different conclusive outcomes does not exceed unity we obtain a general solution. As an application, we consider the discrimination of two mixed qubit states. Moreover, for the case of higher-rank detection operators we give a solution for particular states. The relation of the optimized measurement to other discrimination schemes is also discussed.Comment: 7 pages, 1 figure, accepted for publication in Phys. Rev.

Unambiguous comparison of the states of multiple quantum systems

We consider N quantum systems initially prepared in pure states and address the problem of unambiguously comparing them. One may ask whether or not all $N$ systems are in the same state. Alternatively, one may ask whether or not the states of all N systems are different. We investigate the possibility of unambiguously obtaining this kind of information. It is found that some unambiguous comparison tasks are possible only when certain linear independence conditions are satisfied. We also obtain measurement strategies for certain comparison tasks which are optimal under a broad range of circumstances, in particular when the states are completely unknown. Such strategies, which we call universal comparison strategies, are found to have intriguing connections with the problem of quantifying the distinguishability of a set of quantum states and also with unresolved conjectures in linear algebra. We finally investigate a potential generalisation of unambiguous state comparison, which we term unambiguous overlap filtering.Comment: 20 pages, no figure